Secure K-NN Algorithm for Distributed Databases
نویسندگان
چکیده
In this paper we present an algorithm for determining k-nearest neighbor tuples for a given tuple in a set of geographically distributed databases. These databases form a vertical partitioning of some implicit global database. The computation is performed by exchanging minimum number of higher level summaries so that even if they are captured by an intruder to actual data tuples can ever be revealed.
منابع مشابه
Efficient Maximum Range Search on Remote Spatial Databases Using k-Nearest Neighbor Queries
Supporting aggregate range queries on remote spatial databases suffers from 1) huge and/or large numbers of databases, and 2) limited type of access interfaces. This paper applies the Regular Polygon based Search Algorithm (RPSA) to effectively addressing these problems. This algorithm requests a series of k-NN queries to obtain approximate aggregate range query results. The query point of a su...
متن کاملOptimized Seizure Detection Algorithm: A Fast Approach for Onset of Epileptic in EEG Signals Using GT Discriminant Analysis and K-NN Classifier
Background: Epilepsy is a severe disorder of the central nervous system that predisposes the person to recurrent seizures. Fifty million people worldwide suffer from epilepsy; after Alzheimer’s and stroke, it is the third widespread nervous disorder.Objective: In this paper, an algorithm to detect the onset of epileptic seizures based on the analysis of brain electrical signals (EEG) has b...
متن کاملThe Privacy of k-NN Retrieval for Horizontal Partitioned Data -- New Methods and Applications
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retrieval operation for many data mining algorithms, especially clustering and k-NN classification. The algorithms that efficiently support k-NN queries are of special interest. We show how to adapt well-known data structu...
متن کاملEfficient k Nearest Neighbor Queries on Remote Spatial Databases Using Range Estimation (Draft Version)
K-Nearest Neighbor (k-NN) queries are used in GIS and CAD/CAM applications to find the k spatial objects closest to some given query points. Most previous k-NN research has assumed that the spatial databases to be queried are local, and that the query processing algorithms have direct access to their spatial indices, e.g. R-trees. Clearly, this assumption does not hold when k-NN queries are dir...
متن کاملPrivacy Preserving and Secure Mining of Association Rules in Distributed Data Base
Association rule mining is an active data mining research area and most ARM algorithms cater to a centralized environment. Centralized data mining to discover useful patterns in distributed databases isn't always feasible because merging data sets from different sites incurs huge network communication costs. In this paper, an improved algorithm based on good performance level for data mining is...
متن کامل